Reinforcing reachable routes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reinforcing Reachable Routes

This paper studies the evaluation of routing algorithms from the perspective of reachability routing, where the goal is to determine all paths between a sender and a receiver. Reachability routing is becoming relevant with the changing dynamics of the Internet and the emergence of low-bandwidth wireless/ad-hoc networks. We make the case for reinforcement learning as the framework of choice to r...

متن کامل

Manufacturing Process Routes for Reinforcing Steels

In the UK, and in many other parts of the world, reinforcing steels are specified to British Standards, or very similar, which in the main do not specify process routes. As a result, many specifiers, purchasers and users are unaware of the different process routes used in their manufacture. Manufacturing process routes for some of the reinforcing steel products used have changed considerably in...

متن کامل

Completely Reachable Automata

We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.

متن کامل

Planning with Reachable Distances

Motion planning for spatially constrained robots is difficult due to additional constraints placed on the robot, such as closure constraints for closed chains or requirements on end effector placement for articulated linkages. It is usually computationally too expensive to apply sampling-based planners to these problems since it is difficult to generate valid configurations. We overcome this ch...

متن کامل

Reachable sets concept - a

A control problem over the infinite time horizon for periodical system is considered. Our aim is to analyze a special concept of solving problems of this type, based on the known idea of reachable sets. We try to consider this concept in a more general manner than it was done in earlier works and to find what is really essential in it. The algorithm corresponding to the proposed general descrip...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Networks

سال: 2003

ISSN: 1389-1286

DOI: 10.1016/s1389-1286(03)00288-3